Dynamic Programming with Convexity, Concavity, and Sparsity

A fast algorithm for computing longest common subse-quences. [J82] Johnson, D. B. A priority queue in which initialization and queue operations take O(log log D) Pattern recognition in nucleic acid sequences II: an ecient method for nding locally stable secondary structures. A simple linear time algorithm for concave one-dimensional dynamic programming. preprint, 1990. almost linear time algorithm for generalized matrix searching. On-line dynamic programming with applications to the prediction of RNA secondary structure. A general method applicable to the search for similarities in the amino acid sequence of two proteins. convex and concave cost functions. A linear-time algorithm for concave one-dimensional dynamic programming. On-line context-free language recognition in less than cubic time.